Probabilistic automaton
GENERALIZATION OF THE NON-DETERMINISTIC FINITE AUTOMATON
Probabilistic automata; Probalistic automaton; Stochastic language; Probabilistic finite automata; Probabilistic finite automaton; P-adic language; Stochastic finite state machine
In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the nondeterministic finite automaton; it includes the probability of a given transition into the transition function, turning it into a transition matrix. Thus, the probabilistic automaton also generalizes the concepts of a Markov chain and of a subshift of finite type.